Local Search Heuristics: Fitness Cloud versus Fitness Landscape
نویسندگان
چکیده
This paper introduces the concept of fitness cloud as an alternative way to visualize and analyze search spaces than given by the geographic notion of fitness landscape. It is argued that the fitness cloud concept overcomes several deficiencies of the landscape representation. Our analysis is based on the correlation between fitness of solutions and fitnesses of nearest solutions according to some neighboring. We focus on the behavior of local search heuristics, such as hill climber, on the well-known NK fitness landscape. In both cases the fitness vs. fitness correlation is shown to be related to the epistatic parameter K.
منابع مشابه
ha l - 00 15 99 94 , v er si on 1 - 4 J ul 2 00 7 Where are Bottlenecks in NK Fitness Landscapes ?
Usually the offspring-parent fitness correlation is used to visualize and analyze some caracteristics of fitness landscapes such as evolvability. In this paper, we introduce a more general representation of this correlation , the Fitness Cloud (FC). We use the bottleneck metaphor to emphasise fitness levels in landscape that cause local search process to slow down. For a local search heuristic ...
متن کاملWhere are bottlenecks in NK fitness landscapes?
Usually the offspring-parent fitness correlation is used to visualize and analyze some caracteristics of fitness landscapes such as evolvability. In this paper, we introduce a more general representation of this correlation, the Fitness Cloud (FC). We use the bottleneck metaphor to emphasise fitness levels in landscape that cause local search process to slow down. For a local search heuristic s...
متن کاملFitness Landscape Analysis of Hyper-Heuristic Transforms for the Vertex Cover Problem
Hyper-heuristics have recently proved efficient in several areas of combinatorial search and optimization, especially scheduling. The basic idea of hyperheuristics is based on searching for search-strategy. Instead of traversing the solution-space, the hyper-heuristic traverses the space of algorithms to find or construct an algorithm best suited for the given problem instance. The observed eff...
متن کاملAn iterative local search approach based on fitness landscapes analysis for the delay-constrained multicast routing problem
This paper presents the first fitness landscape analysis on the delay-constrained least-cost multicast routing problem (DCLC-MRP), a well-known NP-hard problem. Although the problem has attracted an increasing research attention over the past decade in telecommunications and operational research, little research has been conducted to analyze the features of its underlying landscape. Two of the ...
متن کاملFitness Landscapes of Combinatorial Problems And
This work settles in the framework of the tness landscape paradigm and its application to combinatorial problems. We study the interdependance of tness landscapes and heuristics, and gure out some TSP landscapes statistical characteristics associated with local search operators. Then we use this knowledge to shed some light on the general behavior of TSP search algorithms, and derive a simple p...
متن کامل